On Minimal Ordered Structures
نویسندگان
چکیده
We partially describe minimal, first-order structures which have a strong form of the strict order property. An infinite first-order structure is minimal if its each definable (possibly with parameters) subset is either finite or co-finite. It is strongly minimal if the minimality is preserved in elementarily equivalent structures. While strongly minimal structures were investigated more closely in a number of papers beginning with [4] and [1], there are a very few results on minimal but not strongly minimal structures. For some examples see [2] and [3]. In this paper we shall consider minimal, ordered structures. A first-order structure M0 = (M0, . . . ) is ordered if there is a binary relation < on M0, which is definable possibly with parameters from M0, irreflexive, antisymmetric, transitive and has arbitrarily large finite chains. We usually distinguish (one) such relation by absorbing the involved parameters into the language and assuming that < is an interpretation of a relation symbol from the language, in which case we write M0 = (M0, <, . . . ). Two basic examples of minimal, ordered structures are (ω, <) and (ω + ω∗, <) (where ω∗ is reversely ordered ω and + denotes the (ordinal) sum of partial orders). We can modify a basic example by replacing the original order by a new one, so that the structure remains minimal, ordered. For example, we can change < by taking a finite set of elements from the domain and rearranging them arbitrarily, leaving the order of the other elements unchanged; e.g. we can take 0 ∈ ω and make it bigger than all other elements, or incompatible to the others. Also, we can simply reverse the original order. Note that the ’new’ order obtained in either way is inter-definable with the original one, so that the structure remains unchanged. Further, we can enlarge basic structure as follows: starting with (ω, <) we can replace each n ∈ ω by some (large enough) finite set L(n) and define for a ∈ L(n) and b ∈ L(m): a < b iff n < m. For example (details are left to the reader): 1991 Mathematics Subject Classification: Primary 03C50; Secondary 03C15. The author is supported by Ministry of Science and Technology of Serbia.
منابع مشابه
On dp-minimal ordered structures
We show basic facts about dp-minimal ordered structures. The main results are: dp-minimal groups are abelian-by-finite-exponent, in a divisible ordered dp-minimal group, any infinite set has non-empty interior, and any theory of pure tree is dp-minimal.
متن کاملCharacterizing Ordered Bi-Ideals in Ordered Γ-Semigroups
The notion of a &Gamma-semigroup was introduced by Sen [8] in 1981. We can see that any semigroup can be considered as a &Gamma-semigroup. The aim of this article is to study the concept of (0-)minimal and max- imal ordered bi-ideals in ordered &Gamma-semigroups, and give some charac- terizations of (0-)minimal and maximal ordered bi-ideals in ordered &Gamma- semigroups analogous to the charact...
متن کاملWeakly O-minimal Structures and Real Closed Fields
A linearly ordered structure is weakly o-minimal if all of its definable sets in one variable are the union of finitely many convex sets in the structure. Weakly o-minimal structures were introduced by Dickmann, and they arise in several contexts. We here prove several fundamental results about weakly o-minimal structures. Foremost among these, we show that every weakly o-minimal ordered field ...
متن کاملStructures Having O-minimal Open Core*
The open core of an expansion of a dense linear order is its reduct, in the sense of definability, generated by the collection of all of its open definable sets. In this paper, expansions of dense linear orders that have o-minimal open core are investigated, with emphasis on expansions of densely ordered groups. The first main result establishes conditions under which an expansion of a densely ...
متن کاملOn ordered minimal structures
Recall that a structure M is minimal if every definable (with parameters) subset of M is either finite or cofinite. The study of minimal partially ordered structures was initiated by Tanović in [4, 5]. The results from [4, 5] were essential in the proof by Tanović of the Pillay’s conjecture [1], which states that every countable structure in a countable language has infinitely many nonisomorphi...
متن کامل